From Text to Horn Clauses: Combining Linguistic Analysis and Machine Learning
نویسندگان
چکیده
The paper describes a system that extracts knowledge from technical English texts. Our basic assumption is that in technical texts syntax is a reliable indication of meaning. Consequently, semantic interpretation of the text starts from surface syntax. The linguistic component of the system uses a broad-coverage, domainindependent parser of English, as well as a user-assisted semantic interpreter that memorizes its experience. The resulting semantic structures are translated into Horn clauses, a representation suitable for Explanation-based Learning (EBL). An EBL engine performs symbol-level learning on representations of both the domain theory and the example provided by the linguistic part of the system. Our approach has been applied to the Canadian Individual Income Tax Guide and examples from it are used in the presentation.
منابع مشابه
Incorporating Cognitive Linguistic Insights into Classrooms: the Case of Iranian Learners’ Acquisition of If-Clauses
Cognitive linguistics gives the most inclusive, consistent description of how language is organized, used and learned to date. Cognitive linguistics contains a great number of concepts that are useful to second language learners. If-clauses in English, on the other hand, remain intriguing for foreign language learners to struggle with, due to their intrinsic intricacies. EFL grammar books are ...
متن کاملLearning First-Order Horn Clauses from Web Text
Even the entire Web corpus does not explicitly answer all questions, yet inference can uncover many implicit answers. But where do inference rules come from? This paper investigates the problem of learning inference rules from Web text in an unsupervised, domain-independent manner. The SHERLOCK system, described herein, is a first-order learner that acquires over 30,000 Horn clauses from Web te...
متن کاملCryptographic Limitations on Learning One-Clause Logic Programs
An active area of research in machine learning is learning logic programs from examples. This paper investigates formally the problem of learning a single Horn clause: we focus on generalizations of the language of constant-depth determinate clauses, which is used by several practical learning systems. We show rst that determinate clauses of logarithmic depth are not learnable. Next we show tha...
متن کاملaphic Limitations se Logic Programs
An active area of research in machine learning is learning logic programs from examples. This paper investigates formally the problem of learning a single Horn clause: we focus on generalizations of the language of constant-depth determinate clauses, which is used by several practical learning systems. We show first that determinate clauses of logarithmic depth are not learnable. Next we show t...
متن کاملSome Lower Bounds for the Computational Complexity of Inductive Logic Programming
The eld of Inductive Logic Programming (ILP), which is concerned with the induction of Horn clauses from examples and background knowledge , has received increased attention over the last time. Recently, some positive results concerning the learnability of restricted logic programs have been published. In this paper we review these restrictions and prove some lower-bounds of the computational c...
متن کامل